Bounds for DNA Codes with Constant GC-Content
نویسندگان
چکیده
منابع مشابه
Bounds for DNA Codes with Constant GC-Content
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published c...
متن کاملNew lower bounds for constant weight codes
with M (which is expected). However, as M increases beyond Ahstrart -Some new lower bounds are given for A(n,4, IV), the maximum number of codewords in a binary code of length n, min imum distance 4, and constant weight IV. In a number of cases the results significantly 1.0 improve on the best bounds previously known. h=O 1 .
متن کاملUpper bounds for constant-weight codes
Let ( ) denote the maximum possible number of codewords in an ( ) constant-weight binary code. We improve upon the best known upper bounds on ( ) in numerous instances for 24 and 12, which is the parameter range of existing tables. Most improvements occur for = 8 10 where we reduce the upper bounds in more than half of the unresolved cases. We also extend the existing tables up to 28 and 14. To...
متن کاملJohnson type bounds on constant dimension codes
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Nain...
متن کاملNew LMRD bounds for constant dimension codes and improved constructions
Let V ∼= Fq be a v-dimensional vector space over the finite field Fq with q elements. By [ V k ] we denote the set of all k-dimensional subspaces in V . Its size is given by the q-binomial coefficient [ v k ]q = ∏k−1 i=0 qv−qi qk−qi for 0 ≤ k ≤ v and 0 otherwise. The set of all subspaces of V forms a metric space associated with the so-called subspace distance dS(U,W ) = dim(U + W ) − dim(U ∩ W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2003
ISSN: 1077-8926
DOI: 10.37236/1726